Now showing items 1-2 of 2

    • Boyer, Laurent; Delacourt, Martin; Poupet, Victor; Sablik, Mathieu; Theyssier, Guillaume (Academic Press, 2015)
      This paper concerns mu-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial mu-random configuration. More precisely, we ...
    • Ríos Wilson, Martín Alonso Facundo (Universidad de Chile, 2021)
      An automata network (AN) is a network of entities, each holding a state from a finite set and related by a graph structure called an \emph{interaction graph}. Each node evolves according to the states of its neighbors in ...